Stability of the Discretized Pantograph Differential Equation

نویسندگان

  • MARTIN BUHMANN
  • ARIEH ISERLES
چکیده

In this paper we study discretizations of the general pantograph equation y'(t) = ay(t) + by(6(t)) + cy'((t)), f>0, y(0)=y0, where a , b , c , and yo are complex numbers and where 9 and <¡> are strictly increasing functions on the nonnegative reals with 0(0) = <^>(0) = 0 and 8(t) < t, 4>(t) < t for positive /. Our purpose is an analysis of the stability of the numerical solution with trapezoidal rule discretizations, and we will identify conditions on a , b , c and the stepsize which imply that the solution sequence {yn/^o 's DOunded or that it tends to zero algebraically, as a negative power of n . X. Introduction In this article we shall consider, in the most general form, the generalized pantograph equation (1.1) y'(t) = ay(t) + by(d(t)) + cy'(0, y(0)=y0, where a, b, c, and yo are complex and where 8 and (t)) is called the "neutral" term. Our principal focus in this paper is the case of proportional delays 8(t) = qt and 4>(t) = pt, where q and p are between 0 and 1. The equation (1.1) can also be considered for vector-valued y and matrices a, b, c, but we will dispense with this generalization here. There are many applications for the generalized pantograph equation. Here we only mention applications in number theory (Mahler [15]), in electrodynamics (Fox et al. [9]) and the collection of current by the pantograph of an electric locomotive (whence its name; cf. Ockendon and Tayler [18]), and in nonlinear dynamical systems (Derfel [6]). A more comprehensive list features in Iserles [12]. Delay differential equations with constant delays, i.e., c = 0 and 6(t) = t-x, where one also prescribes y's values on (-t, 0), have been investigated extensively in the past (see, for instance, Bellman and Cooke [1,2] and Hale [10]). Received by the editor October 18, 1991 and, in revised form, May 8, 1992. 1991 Mathematics Subject Classification. Primary 34K20, 65L20; Secondary 34K40. © 1993 American Mathematical Society 0025-5718/93 $1.00+ $.25 per page

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discretized Stability and Error Growth of The Nonautonomous Pantograph Equation

This paper is concerned with the stability properties of Runge–Kutta methods for the pantograph equation, a functional differential equation with a proportional delay. The focus is on nonautonomous equations. Both linear and nonlinear cases are considered. Sufficient and necessary conditions for the asymptotic stability of the numerical solution of general neutral pantograph equations are given...

متن کامل

Asymptotic Stability of Runge-kutta Methods for the Pantograph Equations

This paper considers the asymptotic stability analysis of both exact and numerical solutions of the following neutral delay differential equation with pantograph delay. ⎧⎨ ⎩ x′(t) +Bx(t) + Cx′(qt) +Dx(qt) = 0, t > 0, x(0) = x0, where B,C,D ∈ Cd×d, q ∈ (0, 1), and B is regular. After transforming the above equation to non-automatic neutral equation with constant delay, we determine sufficient co...

متن کامل

Solution of Nonlinear Second-Order Pantograph Equations via Differential Transformation Method

In this work, we successfully extended one-dimensional differential transform method (DTM), by presenting and proving some theorems, to solving nonlinear high-order multi-pantograph equations. This technique provides a sequence of functions which converges to the exact solution of the problem. Some examples are given to demonstrate the validity and applicability of the present method and a comp...

متن کامل

An efficient numerical method for singularly perturbed second order ordinary differential equation

In this paper an exponentially fitted finite difference method is presented for solving singularly perturbed two-point boundary value problems with the boundary layer. A fitting factor is introduced and the model equation is discretized by a finite difference scheme on an uniform mesh. Thomas algorithm is used to solve the tri-diagonal system. The stability of the algorithm is investigated. It ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010